Learnability of Kolmogorov - Easy
نویسندگان
چکیده
Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We study here the case in which the circuit expressions are of low (time-bounded) Kolmogorov complexity. We show that these are polynomial-time learnable from membership queries in the presence of an NP oracle. We also exactly characterize the sets that have such circuit expressions, and precisely identify the subclass whose circuit expressions can be learned from membership queries alone. The extension of the results to various Kolmogorov complexity bounds is discussed.*
منابع مشابه
Circuit Expressions of Low Kolmogorov Complexity
We study circuit expressions of logarithmic and poly-logarithmic polynomial-time Kolmogorov complexity, focusing on their complexity-theoretic characterizations and learnability properties. They provide a nontrivial circuit-like characterization for a natural nonuniform complexity class that lacked it up to now. We show that circuit expressions of this kind can be learned with membership querie...
متن کاملBounded Context Parsing And Easy Learnability
Natural langt~ages are often assumed to be constrained so that they are either easily learnable or parsdble, but few studies have investigated the conrtcction between these two "'functional'" demands, Without a fonnal model of pamtbility or learnability, it is difficult to determine which is morc "dominant" in fixing the properties of natural languages. In this paper we show that if we adopt on...
متن کاملInside the Muchnik Degrees: Discontinuity, Learnability, and Constructivism
Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify nonuniformly computable functions on Baire space from the viewpoint of learning theory and piecewise computability. For instance, we show that mind-change-bounded-lear...
متن کاملNotations for Software Engineering Class Structures
This builds on previous work in which we have developed diagramming principles based on theories of structural object perception. We call these geon diagrams. We have previously shown that such diagrams are easy to remember and to analyze. To evaluate our hypothesis that geon diagrams should also be easy to understand we carried out an empirical study to evaluate the learnability of geon diagra...
متن کاملThe Cultural Evolution of Human Communication Systems in Different Sized Populations: Usability Trumps Learnability
This study examines the intergenerational transfer of human communication systems. It tests if human communication systems evolve to be easy to learn or easy to use (or both), and how population size affects learnability and usability. Using an experimental-semiotic task, we find that human communication systems evolve to be easier to use (production efficiency and reproduction fidelity), but h...
متن کامل